Research of Smart Payment System of Power Grid Using Strongly Sub-feasible SQP Algorithm
نویسندگان
چکیده
منابع مشابه
fault location in power distribution networks using matching algorithm
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
effect of sub-grid scales on large eddy simulation of particle deposition in a turbulent channel flow
چکیده ندارد.
15 صفحه اولAn Advanced Hysteresis Controller to Improve Voltage Profile of Power System with PV Units: A Smart Grid Power Exchange Framework
Unlike traditional power grids, smart grids have the advantage of bidirectional power flow and having distributed generations. Distributed generation systems are usually supplied by renewable sources which can cause unpredicted voltage fluctuations as a result of being intermittent. While traditional compensating devices deal with the problem of voltage fluctuation and reduced power quality wit...
متن کاملOptimization of grid independent diesel-based hybrid system for power generation using improved particle swarm optimization algorithm
The power supply of remote sites and applications at minimal cost and with low emissions is an important issue when discussing future energy concepts. This paper presents modeling and optimization of a photovoltaic (PV)/wind/diesel system with batteries storage for electrification to an off-grid remote area located in Rafsanjan, Iran. For this location, different hybrid systems are studied and ...
متن کاملA Superlinearly feasible SQP algorithm for Constrained Optimization
This paper is concerned with a Superlinearly feasible SQP algorithm algorithm for general constrained optimization. As compared with the existing SQP methods, it is necessary to solve equality constrained quadratic programming sub-problems at each iteration, which shows that the computational effort of the proposed algorithm is reduced further. Furthermore, under some mild assumptions, the algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2017
ISSN: 2261-236X
DOI: 10.1051/matecconf/201713900083